Some Instances of Unscientific Administration

Independent Instances for Some Undecidable Problems

— In this note we prove the existence of effectively independent instances (with respect to an arbitrary recursively axiomatizable, consistent, intuitively true and sufficiently rich theory) for some well-known undecidable problems including the Emptiness Problem, the Finiteness Problem, the Totality Problem, the Halting Problem and the Post Correspondence Problem. Applications in the Theory of...

Homeopathy Is Unscientific and Unethical

Inhibitors of fibrinolysis: evidence of some instances of mutual potentiation.

Inhibitors of fibrinolysis may be divided into naturally circulating inhibitors and antifibrinolytic agents. Natural inhibitors are present in plasma and are components of blood cells, especially platelets. Several types of antifibrinolytic activity can be distinguished: antiplasmin activity, and anti-activator activity against streptokinase, urokinase, and tissue activator induced plasminogen ...

Computational complexity of some restricted instances of 3-SAT

Tovey [10] showed that it is NP-hard to decide the satisfiability of 3-SAT instances in which every variable occurs four times, while every instance of 3-SAT in which each variable occurs three times is satisfiable. We explore the border between these two problems. Answering a question of Iwama and Takaki, we show that, for every fixed k ≥ 0, there is a polynomial time algorithm to determine th...

Attacks on the Rsa Cryptosystem and Some of Its Instances

Two types of attacking the RSA cryptosystem are discussed. The rst aims at a careless choice of the primes p and q, which are the basis of RSA security. Choosing these primes carefully can prevent the cryptosystem from this type of attack. The second aims at special instances of RSA-based cryptographical protocols. Speciic properties of these protocols enable users of the system or even outside...